Adaptive statistical scheduling of divisible workloads in heterogeneous systems

نویسندگان

  • Horacio González-Vélez
  • Murray Cole
چکیده

This article presents a statistical approach to the scheduling of divisible workloads. Structured as a task farm with different scheduling modes including adaptive single and multi-round scheduling, this novel divisible load theory approach comprises two phases, calibration and execution, which dynamically adapt the installment size and number. It introduces the concept of a generic installment factor based on the statistical dispersion of the calibration times of the participating nodes, which allows automatic determination of the number and size of the workload installments. Initially, the calibration ranks processors according to their fitness and determines an installment factor based on how different their execution times are. Subsequently, the execution iteratively distributes the workload according to the processor fitness, which is continuously re-assessed throughout the program execution. Programmed as an adaptive algorithmic skeleton, our task farm has been successfully evaluated for single-round scheduling and generic multi-round scheduling using a computational biology parameter-sweep in a nondedicated multi-cluster system. H. González-Vélez ( ) Robert Gordon University, School of Computing, Aberdeen AB25 1HG, UK e-mail: [email protected] H. González-Vélez Digital Technologies, IDEAS Research Institute, Aberdeen, UK e-mail: [email protected] M. Cole University of Edinburgh, School of Informatics, Edinburgh EH8 9AB, UK e-mail: [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads

In this paper we present an algorithm for scheduling parallel applications that consist of a divisible workload. Our algorithm uses multiple rounds to overlap communication and computation between a master and several workers. Multi-round scheduling has been used for divisible workloads in previous work and our contribution is as follows. We use “uniform” rounds, i.e. a fixed amount of work is ...

متن کامل

Scheduling divisible workloads on heterogeneous platforms q

In this paper, we discuss several algorithms for scheduling divisible workloads on heterogeneous systems. Our main contributions are (i) new optimality results for single-round algorithms and (ii) the design of an asymptotically optimal multi-round algorithm. This multi-round algorithm automatically performs resource selection, a difficult task that was previously left to the user. Because it i...

متن کامل

Closed form Solution for Scheduling Arbitrarily Divisible Load Model in Data Grid Applications: Multiple Sources

Scheduling an application in data grid was significantly complex and very challenging because of its heterogeneous in nature of the grid system. When the Divisible Load Theory (DLT) model had emerged as a powerful model for modeling data-intensive grid problem, Task Data Present (TDP) model was proposed based on it. This study presented a new Adaptive TDP (ATDP) for scheduling the intensive gri...

متن کامل

The Deadline-based Scheduling of Divisible Real-time Workloads on Multiprocessor Platforms Suriayati Bt Chuprat Universiti Teknologi Malaysia the Deadline-based Scheduling of Divisible Real-time Workloads on Multiprocessor Platforms

Current formal models of real-time workloads were designed within the context of uniprocessor real-time systems; hence, they are often not able to accurately represent salient features of multiprocessor real-time systems. Researchers have recently attempted to overcome this shortcoming by applying workload models from Divisible Load Theory (DLT) to real-time systems. The resulting theory, refer...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Scheduling

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2010